Confluence and termination of fuzzy relations
نویسندگان
چکیده
Confluence and termination are essential properties connected to the idea of rewriting and substituting which appear in abstract rewriting systems. The aim of the present paper is to investigate confluence, termination, and related properties from the point of view of fuzzy logic leaving the ordinary notions a particular case when the underlying structure of truth degrees is two-valued Boolean algebra. The main motivation of this study is the fact that in several natural situations, the notion of substitutability is inherently fuzzy rather than crisp. 2010 Elsevier Inc. All rights reserved.
منابع مشابه
A fuzzy Petri net model for intelligent databases
Knowledge intensive applications require an intelligent environment, which can perform deductions in response to user queries or events that occur inside or outside of the applications. For that, we propose a fuzzy Petri net (FPN) model to represent knowledge and the behavior of an intelligent object-oriented database environment, which integrates fuzzy, active and deductive rules with database...
متن کاملOn Modularity of Termination and Confluence Properties of Conditional Rewrite Systems
We investigate the modularity behaviour of termination and connuence properties of conditional term rewriting systems. In particular , we show how to obtain suucient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination , (strong) termination, connuence and completeness of conditional rewrite systems.
متن کاملIwc 2013 2nd International Workshop on Confluence Program Committee Three Termination Problems Confluence and Infinity -a Kaleidoscopic View Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering (extended Abstract)
s of Invited Talks Three Termination Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Patrick Dehornoy Confluence and Infinity a kaleidoscopic view . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Jan Willem Klop
متن کاملFakultät für Informatik Relative Termination
"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite Systemrelatively termmates, one may reuse the common termination quasiordenngs. Further proof methods become available by the Cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion of ...
متن کاملOn Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems
We investigate the modularity behaviour of termination and connuence properties of (join) conditional term rewriting systems. We give counterexamples showing that the properties weak termination, weak innermost termination and (strong) innermost termination are not preserved in general under signature extensions. Then we develop suucient conditions for the preservation of these properties under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 180 شماره
صفحات -
تاریخ انتشار 2010